Why is light text harder to read than dark text?
نویسندگان
چکیده
منابع مشابه
Why Is Simulation Harder than Bisimulation?
Why is deciding simulation preorder (and simulation equivalence) computationally harder than deciding bisimulation equivalence on almost all known classes of processes? We try to answer this question by describing two general methods that can be used to construct direct one-to-one polynomial-time reductions from bisimulation equivalence to simulation preorder (and simulation equivalence). These...
متن کاملWhen Visual Programs are Harder to Read than Textual Programs
Claims for the virtues of visual programming languages have generally been strong, simple-minded statements that visual programs are inherently better than textual ones. They have paid scant attention to previous empirical literature showing difficulties in comprehending visual programs. This paper reports comparisons between the comprehensibility of textual and visual programs, drawing on the ...
متن کاملBreaking up is hard to do: why disinvestment in medical technology is harder than investment.
Healthcare technology is a two-edged sword - it offers new and better treatment to a wider range of people and, at the same time, is a major driver of increasing costs in health systems. Many countries have developed sophisticated systems of health technology assessment (HTA) to inform decisions about new investments in new healthcare interventions. In this paper, we question whether HTA is als...
متن کاملIs Belief Revision Harder Than You Thought?
Suppose one wishes to construct, use, and maintain a knowledge base (KB) of beliefs about the real world, even though the facts about that world are only partially known. In the AI domain, this problem arises when an agent has a base set of beliefs that reflect partial knowledge about the world, and then tries to incorporate new, possibly contradictory knowledge into this set of beliefs. We cho...
متن کاملStatic Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version, one checks if the adversary can notice any difference between protocol runs with different values of the secret parameter. We give a new proof that when considering more complex equational theories than partially inve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2005
ISSN: 1534-7362
DOI: 10.1167/5.8.812